Spectral graph theory
نویسنده
چکیده
Let us first review some basic random graph models. The most popular is perhaps the Erdös-Rényi model, denoted by G(n, p) for some n ∈ N and p ∈ [0, 1]. In this model, there is a set of vertices V (with n = |V |), and the edge set over V is determined randomly by ( n 2 ) biased coin tosses. Initially, there are no edges: E := ∅. Then, for each pair of vertices u, v ∈ V , independently flip a coin with heads bias p; if the coin comes up heads, add {u, v} to E. The adjacency matrix A for the graph is a random matrix: the diagonal entries are fixed to zero, and the off-diagonal entries are {0, 1}random variables with EAu,v = p. (Note that A is a random symmetric matrix, so the entries are not all independent.) A natural variant of G(n, p) provides a random bipartite graph; let’s called this model G(n1, n2, p). In this model, we have two disjoint sets of vertices (say, V1 and V2 with n1 = |V1| and n2 = |V2|). There are initially no edges: E := ∅. Then, for each pair of vertices u ∈ V1 and v ∈ V2, independently flip a coin with heads bias p; if the coin comes up heads, add {u, v} to E. As before, the adjacency matrix A for the graph is a random matrix: the entries Au,v corresponding to u, v ∈ V1 or u, v ∈ V2 are fixed to zero, and the entries corresponding to u ∈ V1 and v ∈ V2 (or u ∈ V2 and v ∈ V1) are {0, 1}-random variables with EAu,v = p. In the (basic) planted partition model, there are disjoint sets of vertices V1, V2, . . . , Vk (say, with ni := |Vi|, V := V1∪V2, . . . , Vk, n := n1 +n2 + · · ·+ nk = |V |); each set Vi represents a cluster. The edges within each set Vi are determined by G(ni, p); the edges across any pair of sets Vi and Vj are determined by G(ni, nj , q). Here, p, q ∈ [0, 1] are parameters of the model, and we assume p > q, so that it is more likely to to have an edge between vertices within the same cluster than it is between vertices from different
منابع مشابه
SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملTHE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
متن کاملMathematical Chemistry Works of Dragos Cvetkovic
In addition to his countless contributions to spectral graph theory, some works of Dragos Cvetkovic are concerned with chemical problems. These are briefly outlined, with emphasis on his collaboration with the present author.
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کامل